Unifying Ocean Data into One Searchable Set
نویسندگان
چکیده
منابع مشابه
Searchable Querical Data Networks
Recently, a new family of massive self-organizing networks has emerged that not only serve as a communication infrastructure, but also mainly as a distributed query processing system. We term these networks Querical Data Networks (QDNs). Peer-to-peer networks are examples of QDN. In this paper, first we identify and characterize QDN as a new family of data networks with common characteristics a...
متن کاملSearchable Encryption for Outsourced Data Analytics
Two sets of privacy requirements need to be fulfilled when a company’s accounting data is audited by an external party: the company needs to safeguard its data, while the auditors do not want to reveal their investigation methods. This problem is usually addressed by physically isolating data and auditors during the course of an audit. This approach however no longer works when auditing is perf...
متن کاملUnifying Temporal Data
To add time support to the relational model, both rst normal form (1NF) and non-1NF data models have been proposed. Each has associated advantages and disadvantages. For example , remaining within 1NF when time support is added may introduce data redundancy. On the other hand, well-established storage organization and query evaluation techniques require atomic attribute values, and are thus int...
متن کاملOne for All - All for One: Unifying Standard DPA Attacks
In this paper, we examine the relationship between and the efficiency of different approaches to standard DPA attacks. We first show that the most popular approaches such as using a distance-of-means test, correlation analysis, and Bayes attacks are essentially equivalent in this setting. Differences observed in practice are not due to differences in the statistical tests but due to statistical...
متن کاملSet Coverage Problems in a One-Pass Data Stream
Finding a maximum coverage by k sets from a given collection (Max-k-Cover), finding a minimum number of sets with a required coverage (Partial-Cover) are both important combinatorial optimization problems. Various problems from data mining, machine learning, social network analysis, operational research, etc. can be generalized as a set coverage problem. The standard greedy algorithm is efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eos
سال: 2016
ISSN: 2324-9250
DOI: 10.1029/2016eo065527